On linearly ordered H-closed topological semilattices
نویسندگان
چکیده
منابع مشابه
Linearly Ordered Topological Spaces
This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...
متن کاملMetrizability of Topological Semigroups on Linearly Ordered Topological Spaces
The authors use techniques and results from the theory of generalized metric spaces to give a new, short proof that every connected, linearly ordered topological space that is a cancellative topological semigroup is metrizable, and hence embeddable in R. They also prove that every separable, linearly ordered topological space that is a cancellative topological semigroup is metrizable, so embedd...
متن کاملOn Chains in H-Closed Topological Pospaces
We study chains in an H-closed topological partially ordered space. We give sufficient conditions for a maximal chain L in an H-closed topological partially ordered space such that L contains a maximal (minimal) element. Also we give sufficient conditions for a linearly ordered topological partially ordered space to be H-closed. We prove that any H-closed topological semilattice contains a zero...
متن کاملLinearly Ordered Topological Spaces and Weak Domain Representability
It is well known that domain representable spaces, that is topological spaces which are homeomorphic to the space of maximal elements of some domain, must be Baire. In this paper it is shown that every linearly ordered topological space (LOTS) is homeomorphic to an open dense subset of a weak domain representable space. This means that weak domain representable spaces need not be Baire. MR Clas...
متن کاملOn Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference relation on extended literals. This relation, a strict partial order, induces a partial order on extended answer sets. The preferred answer sets, i.e. those that are minimal w.r.t. the induced order, represent the solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2008
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-008-9102-4